Description: delaunay三角剖分程序，能运行，可以显示-delaunay triangulation procedures, will be able to run, you can show that Platform: |
Size: 1937408 |
Author:yanghy |
Hits:
Description: ：本文把星表匹配问题转化成计算机视觉中的对应点匹配问题,接着使用二维Delaunay三角化方法对星表进行三角化,然后用RANSAC方法对星表的自动匹配问题进行了研究。研究结果表明,我们的方法能够快速有效地完成星表匹配。在总共960个样本中,除了两幅不符合匹配的星表之外,全部获得了正确的匹配结果。-: In this paper, the Star into a matching problem in computer vision matching the corresponding points, followed by the use of two-dimensional Delaunay triangulation method to the triangular form of stars, and then use RANSAC method of automatically catalog matching problem is studied. The results show that our method can be completed quickly and efficiently matching catalog. In a total of 960 samples, in addition to the two stars are not in line with the matching table, all access to the correct matching results. Platform: |
Size: 18432 |
Author:lilin |
Hits:
Description: Delaunay triangulation is one of the most well known algorithms for space tesselation. Dynamic Delaunay triangulation, in which you can update the input points using a predefined matrice for saving points, is presented in this document. Platform: |
Size: 139264 |
Author:Ali |
Hits:
Description: 这段代码是一个Delaunay三角网算法。我的想法是要开始一个项目，目的是建立一个强大的有效率三角网/啮合工具。-In this code you will find a Delaunay triangulation algorithm. My idea is to start a project which purpose is to create a robust an efficient triangulation/meshing tool. Platform: |
Size: 2048 |
Author:cuijianzhu |
Hits:
Description: 对lidar数据进行处理，并建立delaunay三角网-On lidar data processing, and the establishment of delaunay triangulation Platform: |
Size: 360448 |
Author:juchengyu |
Hits:
Description: Compute nearest neighbours (by Euclidean distance) to a set of points of interest from a set of candidate points.
The points of interest can be specified as either a matrix of points (as columns) or indices into the matrix of candidate points.
Points can be of any (within reason) dimension.
nearestneighbour can be used to search for k nearest neighbours, or neighbours within some distance (or both)
If only 1 neighbour is required for each point of interest, nearestneighbour tests to see whether it would be faster to construct the Delaunay Triangulation (delaunayn) and use dsearchn to lookup the neighbours, and if so, automatically computes the neighbours this way. This means the fastest neighbour lookup method is always used. Platform: |
Size: 30720 |
Author:nadir |
Hits:
Description: 基于德洛内三角分解的有限元划分，可形成刚度总阵-Delaunay triangulation based on decomposition of the finite element division, the total stiffness matrix can be formed Platform: |
Size: 3072 |
Author:宗保龙 |
Hits:
Description: 用matlab编写的Delaunay三角化的程序，在points里面修改自己的初始点。-Delaunay triangulation using matlab program to modify the initial point, the points inside. Platform: |
Size: 2048 |
Author:sancy |
Hits:
Description: 在matlab中用delaunay函数实现三角剖分，在一个三角形区域内，实现简单的均匀的delaunay剖分。-In matlab function implementation using delaunay triangulation, in the area of a triangle, a simple uniform delaunay triangulation. Platform: |
Size: 1024 |
Author:liang |
Hits:
Description: TRIANGULATION_REFINE is a MATLAB program which reads information describing a triangulation of a set of points and creates a refined triangulation.
The refined triangulation is created by dividing each triangle into four similar subtriangles. The mesh size parameter h will be halved by such a procedure. If the input triangulation is Delaunay, then so will be the output triangulation.
The program can handle triangulations that use 3 or 6 nodes per triangle. Platform: |
Size: 9216 |
Author:Yu Deyang |
Hits:
Description: Delaunay三角网生成，利用离散点生成Delaunay三角网，交互式界面(Delaunay triangulation to generate the use of discrete point generating Delaunay triangulation, interactive interface, intuitive) Platform: |
Size: 2789376 |
Author:asen
|
Hits:
Search - Delaunay Triangulation matlab